战斗机隐蔽接敌轨迹优化方法

针对空战对抗的隐蔽作战需求,对战斗机隐蔽接敌方法进行研究。基于战斗机雷达反射截面积的动态特性建立雷达探测威胁模型;以空战态势参数为状态建立接敌引导模型;以给定目标发现概率为暴露阈值进行威胁约束;以最小化接敌过程中累积被发现概率为性能指标;将战斗机隐蔽接敌问题建模为隐蔽性约束下的最优控制问题。为保证算法的实时性和有效性,引入滚动时域控制策略进行在线优化,并采用高斯伪谱法进行数值求解。仿真实验表明,通过路径约束和性能指标双重约束,能有效增强战斗机接敌的隐蔽性,算法实时性能满足战斗机控制的需求。     

弹道导弹被动段最优脉冲变轨方法

弹道导弹大气层外飞行时间长且弹道固定,易被敌方预测和拦截。针对以上问题,本文提出一种最优脉冲式变轨方法,该方法设计的弹道由2条不同的椭圆弧段组成,成功命中目标的同时,增加了敌方的拦截难度。以机动变轨所需能量和变轨后飞行剩余时间的加权最优为性能指标,设计了利用遗传算法在初始弹道上寻求最优变轨点的方法。最后,将遗传算法搜索最优点结果与遍历搜索结果进行对比,其最大误差为 ,从而验证了遗传算法在应用于导弹变轨问题,用以寻求最优变轨点是准确有效的。     

翼伞精确空投系统归航轨迹规划与控制

翼伞归航轨迹规划与控制问题是翼伞系统在一定初始状态下,利用自身可操作性,完成从初始位置到目标位置的转移问题。针对翼伞空投系统不同归航要求,规划出满足精度要求为圆径概率误差（ CEP ）小于40m的归航轨迹并经过一定量的控制完成翼伞空投系统精确空投任务。首先建立翼伞系统状态空间六自由度模型,并在此基础上提出系统简化稳态模型,通过最优控制方法,规划出满足空投要求的最优归航轨迹后对翼伞进行不断控制直至目标点。最后通过Matlab仿真试验,绘出翼伞系统归航轨迹图与控制变化图。     

火箭助飞鱼雷发控及弹道仿真

针对水面舰艇反潜武器系统研制、火箭助飞鱼雷作战使用研究中对助飞鱼雷的仿真需求,重点研究了助飞鱼雷发射控制仿真方法和空中弹道仿真方法,突破了不同工况不同射程下发动机关机时间建模技术、保证大范围飞行一致性的火箭自适应控制器设计技术。应用表明,所形成的助飞鱼雷武器通道仿真模型能有效模拟助飞鱼雷从发射控制到弹道航行到命中目标的全过程以及作战效果,能够支撑助飞鱼雷发控算法研究以及作战使用研究。     

基于SQP法的助推-滑翔导弹助推段弹道优化研究

轨迹优化是飞行器总体优化设计中的重要组成部分,它贯穿于飞行器的整个设计过程。高超声速助推-滑翔导弹的弹道优化问题涉及攻角、法向过载、最大动压等多种约束条件,是一种复杂的最优控制问题。序列二次规划法（SQP）是解决该类问题行之有效的数值优化方法。本文利用SQP算法对助推-滑翔导弹助推段进行弹道优化,为这一高超声速飞行器的整体结构设计提供了有益的参考。     

远程反舰导弹弹道规划研究

以保证远程反舰导弹迅速捕捉目标为出发点,以远程反舰导弹的作战需求为牵引,论述了对远程反舰导弹进行弹道规划的重要意义;从战术和技术两个方面探索了对远程反舰导弹进行弹道规划的主要依据、基本原则、规划思路和基本方法。     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

高旋弹头滑块控制的建模与仿真

建立了双滑块机构下的高旋弹头动力学分析模型,对气动力矩变化和惯量张量变化给外弹道参数带来的影响进行了仿真研究,结果表明:双滑块机构对弹道三维方向的改变均有效果,同时弹头飞行攻角也是逐渐减小,因此系统的稳定性也是可以得到保证的,这就为后续的闭环控制提供了必要的保证.     

反恐兵力分配运筹方法辅助决策研究

将影响兵力分配决策的各主要因素及其相互关系抽象为线性规划数学模型，通过数学模型的求解，可确定最佳兵力分配方案。模型的建立过程可灵活地体现所有主要的现实需要和考虑因素，因而具有广泛的适用性。计算机软件的引入，可瞬问求得最优解，满足实际作战需要。